package luogu;

import java.util.Scanner;

public class P1098 {
    public static void main(String[] args) {
        //A + 32 = a  a = 97  z = 122  A = 65  Z = 90   0 = 48 9 = 57
        Scanner sc = new Scanner(System.in);
        int p1 = sc.nextInt();
        int p2 = sc.nextInt();
        int p3 = sc.nextInt();
        String s = sc.next();
        StringBuilder res = new StringBuilder();
        for (int i = 0; i < s.length(); i++) {
            if (i != 0 && i != s.length() - 1){
                if (((48<=s.charAt(i + 1)&&s.charAt(i + 1)<=57) && (48<=s.charAt(i - 1)&&s.charAt(i - 1)<=57)) || (((97<=s.charAt(i + 1)&&s.charAt(i + 1)<=122)) && (97<=s.charAt(i - 1)&&s.charAt(i - 1)<=122))){
                    if (s.charAt(i) == '-'){
                        if (Character.toUpperCase(s.charAt(i + 1)) <= Character.toUpperCase(s.charAt(i - 1))){
                            res.append("-");
                        }else if (((48<=s.charAt(i + 1)&&s.charAt(i + 1)<=57) && (97<=s.charAt(i - 1)&&s.charAt(i - 1)<=122)) || (((48<=s.charAt(i - 1)&&s.charAt(i - 1)<=57) && (97<=s.charAt(i + 1)&&s.charAt(i + 1)<=122)))){
                            res.append("-");
                        }
                        else {
                            if (p1 == 3){
                                for (int k = 1; k < Character.toUpperCase(s.charAt(i + 1)) - Character.toUpperCase(s.charAt(i - 1)); k++) {
                                    for (int j = 0; j < p2; j++) {
                                        res.append("*");
                                    }
                                }
                            }
                            if (p1 == 2){
                                if (p3 == 1){
                                    for (int k = 1; k < Character.toUpperCase(s.charAt(i + 1)) - Character.toUpperCase(s.charAt(i - 1)); k++){
                                        for (int j = 0; j < p2; j++) {
                                            res.append((char)(Character.toUpperCase(s.charAt(i - 1)) + k));
                                        }
                                    }
                                }
                                if (p3 == 2){
                                    for (int k = 1; k < Character.toUpperCase(s.charAt(i + 1)) - Character.toUpperCase(s.charAt(i - 1)); k++){
                                        for (int j = 0; j < p2; j++) {
                                            res.append((char) (Character.toUpperCase(s.charAt(i + 1)) - k));
                                        }
                                    }
                                }
                            }
                            if (p1 == 1){
                                if (p3 == 1){
                                    for (int k = 1; k < Character.toLowerCase(s.charAt(i + 1)) - Character.toLowerCase(s.charAt(i - 1)); k++) {
                                        for (int j = 0; j < p2; j++) {
                                            res.append((char) (Character.toLowerCase(s.charAt(i - 1)) + k));
                                        }
                                    }
                                }
                                if (p3 == 2){
                                    for (int k = 1; k < Character.toLowerCase(s.charAt(i + 1)) - Character.toLowerCase(s.charAt(i - 1)); k++) {
                                        for (int j = 0; j < p2; j++) {
                                            res.append((char) (Character.toLowerCase(s.charAt(i + 1)) - k));
                                        }
                                    }
                                }
                            }
                        }
                    }else {
                        res.append(s.charAt(i));
                    }
                }else {
                    res.append(s.charAt(i));
                }
            }else {
                res.append(s.charAt(i));
            }
        }
        System.out.println(res);
    }
}
